<!DOCTYPE html>
<html>

<head>
<meta charset="UTF-8">

<title> 提交记录 4138 - Judge Duck Online </title>

<link rel="icon" type="image/png" href="/images/judgeduck-logo-small.png" />

<script src="/libs/js/jquery-3.2.1.min.js"></script>

<!-- Latest compiled and minified CSS -->
<link rel="stylesheet" href="/libs/css/bootstrap.min.css" />

<!-- Latest compiled and minified JavaScript -->
<script src="/libs/js/bootstrap.min.js"></script>

<link rel="stylesheet" type="text/css" href="/css/main.css" />
<link rel="stylesheet" href="/css/non-responsive.css" type="text/css" />

<script src="/js/md5.js"></script>
<script src="/js/judgeduck.js"></script>

<script type="text/x-mathjax-config">
	MathJax.Hub.Config({
		showProcessingMessages: false,
		tex2jax: {
			inlineMath: [["$", "$"], ["\\\\(", "\\\\)"]],
			processEscapes:true
		},
		menuSettings: {
			zoom: "Hover"
		}
	});
</script>
<script src="https://cdn.jsdelivr.net/npm/mathjax@2.7.1/MathJax.js?config=TeX-AMS_HTML"></script>

<link rel="stylesheet" href="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.css">
<script src="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.js"></script>

</head>

<body onload="">

<!-- Fixed navbar -->
<nav class="navbar navbar-default" role="navigation" style="background-color: #eeeeee">
	<div class="container">
		<div class="navbar-header">
			<div class="navbar-brand">
				<a href="/">
					<img src="/images/judgeduck-logo.png" width="40px" height="40px" style="margin:-10px" />
				</a>
			</div>
			<font class="navbar-brand">
				Judge Duck Online
			</font>
		</div>
		<div class="navbar-collapse collapse">
			<ul class="nav navbar-nav">
				<li class="nav-item">
					<a class="nav-link" href="/index/index.html"> 首页 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/problems/index.html"> 题目列表 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/submissions/index.html"> 提交记录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/blogs/index.html"> 博客 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/faq/index.html"> FAQ </a>
				</li>
			</ul>
			<ul class="nav navbar-nav navbar-right">
				<li class="nav-item">
					<a class="nav-link" href="/user/login/index.html"> 登录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/user/register/index.html"> 注册 </a>
				</li>
			</ul>
		</div><!--/.nav-collapse -->
	</div>
</nav>




<div id="main_div" class="container" style="padding-left: 25px; padding-right: 25px">
	<h2> 提交记录 4138 </h2>
	<hr />
	
	<div class="row">
		<div class="col-xs-12">
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-2"> 用户 </th>
					<th class="col-xs-3"> 题目 </th>
					<th class="col-xs-2"> 状态 </th>
					<th class="col-xs-1"> 得分 </th>
					<th class="col-xs-1"> 用时 </th>
					<th class="col-xs-1"> 内存 </th>
					<th class="col-xs-1"> 语言 </th>
					<th class="col-xs-1"> 代码长度 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> <a href='/user/profile/Iking/index.html'> Iking </a> </td>
<td> <a href='/problem/noi17f/index.html'> noi17f. 【NOI2017】分身术 </a> </td>
<td> Accepted </td>
<td> 100 </td>
<td style='font-size:13px'> 884.203 ms </td>
<td style='font-size:13px'> 37 MB + 392 KB </td>
<td style='font-size:13px'> C++ </td>
<td style='font-size:13px'> 9.68 KB </td>
				</tr>
			</table>
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-6"> 提交时间 </th>
					<th class="col-xs-6"> 评测时间 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> 2018-07-18 21:16:31 </td>
<td style='font-size:13px'> 2019-01-19 02:32:15 </td>
				</tr>
			</table>
			<link rel="stylesheet" href="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/styles/tomorrow.min.css">
			<script src="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/highlight.min.js"></script>
			<script>hljs.initHighlightingOnLoad();</script>
			<div class="row">
				<label for="code"> 代码 </label>
				<pre style="background-color:white"><code class="cpp">#include &lt;cstdio&gt;
#include &lt;cstdlib&gt;
#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#define CLOCKWISE 1
#define ANTICLOCKWISE -1
#define LEFT_CONVEX 1
#define RIGHT_CONVEX -1
#define CONSTRUCT_LAYERS 1
#define SINGLE_QUERY -1
#define MAX_N 100000
#define MAX_LAYERS 100
#define INF (~0U&gt;&gt;1)
using namespace std;

struct Point {
	int x, y;
	int layer, pos;
	int idx;
};
long long cx(Point *a, Point *b, Point *c) {
	return (long long) (b-&gt;x-a-&gt;x)*(c-&gt;y-a-&gt;y) - (long long) (b-&gt;y-a-&gt;y)*(c-&gt;x-a-&gt;x);
}
long long dj(Point *a, Point *b, Point *c) {
	return (long long) (b-&gt;x-a-&gt;x)*(c-&gt;x-a-&gt;x) + (long long) (b-&gt;y-a-&gt;y)*(c-&gt;y-a-&gt;y);
}
struct Hull {
	Point **p;
	int n;
	Hull (int n) {
		p = (Point **) malloc(sizeof(Point *) * (n+2));
		this-&gt;n = n;
	}
	Point *pos(int x) { while (x &lt;= 0) x += n; while (x &gt;= n) x -= n; return p[x]; }
};
struct Convex {
	Point **p;
	int h, t;
	int sign;
	bool refine(Point *a) { bool dom = false; while (h &lt; t &amp;&amp; cx(p[t-1], p[t], a) * sign &gt;= 0) --t, dom = true; return dom; }
	void push(Point *a)   { refine(a); p[++t] = a; }
	Point *peek() 		  { return h == t ? NULL : p[h+1]; }
	Point *pop()          { return p[++h]; }
	Point *top()		  { return p[t]; }
};
struct Opening {
	Point *a, *b;
	int apos, bpos;
	Convex *a_con, *b_con;
};
struct Segment {
	int l, r;
};

long long *v[MAX_LAYERS+10];
long long area;
int removed[MAX_N+10];
int idx[MAX_N+10];

Point *o;
Point *p[MAX_N+10], *p2[MAX_N+10], *q[MAX_N+10], *rp[MAX_N+10];
Point **point_heap;
int p_point_heap;

Hull *layer[MAX_LAYERS+10];

Opening *opening[MAX_LAYERS+10];
Opening **s_op, **t_op, **n_op;
Opening *open;

Convex *convex[MAX_LAYERS+10];
int n_convex;

Segment segment[MAX_LAYERS+10];

bool cmp_pointrp(Point *a, Point *b) {
	return a-&gt;layer == b-&gt;layer ? a-&gt;pos &lt; b-&gt;pos : a-&gt;layer &lt; b-&gt;layer;
}
bool cmp_point2d(Point *a, Point *b) {
	return a-&gt;x == b-&gt;x ? a-&gt;y &lt; b-&gt;y : a-&gt;x &lt; b-&gt;x;
}
bool cmp_opening(Opening *a, Opening *b) {
	return a-&gt;apos &lt; b-&gt;apos;
}
void init() {
	o = new Point();
	o-&gt;x = o-&gt;y = 0;
	point_heap = (Point **) malloc(sizeof(Point*) * (4 * MAX_LAYERS * MAX_LAYERS));
	open = new Opening();
	open-&gt;apos = -INF;
	open-&gt;bpos = INF;
}
void clear_for_query() {
    opening[0] = open;
	s_op = n_op = opening;
	t_op = s_op+1;
	p_point_heap = 0;
	area = v[1][0];
}
Point **point_malloc(int n) {
	Point **p = point_heap + (p_point_heap);
	p_point_heap += n;
	return p;
}
Convex *new_convex(int sign, Point *a) {
	Convex *con = new Convex();
	con-&gt;p = point_malloc(MAX_LAYERS+2);
	con-&gt;h = 1, con-&gt;t = 0;
	con-&gt;sign = sign;
	con-&gt;push(a);
	return con;
}
Opening *new_opening(Point *a, Point *b, Point *pa, Point *pb, Convex *a_con, Convex *b_con) {
	Opening *op = new Opening();
	op-&gt;a = a, op-&gt;b = b;
	op-&gt;apos = pa-&gt;pos, op-&gt;bpos = pb-&gt;pos;
	op-&gt;a_con = a_con;
	op-&gt;b_con = b_con;
	if (op-&gt;apos &gt; op-&gt;bpos)
		op-&gt;bpos += layer[pa-&gt;layer]-&gt;n;
	return op;
}
long long cxsum(Point *a, Point *b) {
	long long *vp = v[a-&gt;layer];
	return a-&gt;pos &lt;= b-&gt;pos ? vp[b-&gt;pos]-vp[a-&gt;pos] : vp[0] - (vp[a-&gt;pos]-vp[b-&gt;pos]);
}
Point *find_tangle(Hull *hull, Point *a, int sign) {
	int n = hull-&gt;n;
	int bias = sign == -1;
	if (n == 0)
		return NULL;
	if (n == 1)
		return hull-&gt;p[n];
	
	Point *b = hull-&gt;pos(sign+bias);

	bool dom = cx(a, hull-&gt;pos(sign+bias), hull-&gt;pos(bias)) * sign &lt;= 0;
	int l = 2, r = n, j, an = 1;
	
	for (; j = (l+r)&gt;&gt;1, l &lt;= r; ) {
		if (cx(a, b, hull-&gt;pos(sign*j+bias)) * sign &lt;= 0) {
			if (dom) r = j-1;
			else l = j+1;
		}
		else if (cx(a, hull-&gt;pos(sign*j+bias), hull-&gt;pos(sign*(j-1)+bias)) * sign &lt;= 0)
			an = j, l = j+1;
		else r = j-1;
	}	return hull-&gt;pos(sign*an+bias);
}
bool find_new_opening(Hull *hull, Point *a, Point *b, Convex *a_con, Convex *b_con) {
	Point *s1 = a, *s2 = b;
	Point *pa, *pb;
	while (a-&gt;idx != b-&gt;idx) {
		pa = find_tangle(hull, a, CLOCKWISE);
		pb = find_tangle(hull, b, ANTICLOCKWISE);

		if (a_con-&gt;peek() &amp;&amp; (pa == NULL || cx(a, pa, a_con-&gt;peek()) &gt;= 0)) {
			area += cx(o, a, a_con-&gt;peek());
			a = a_con-&gt;pop();
		}
		else if (b_con-&gt;peek() &amp;&amp; (pb == NULL || cx(b, b_con-&gt;peek(), pb) &gt;= 0)) {
			area += cx(o, b_con-&gt;peek(), b);
			b = b_con-&gt;pop();
		}
		else {
			area += cx(o, a, pa) + cx(o, pb, b) + cxsum(pa, pb);
			*(++n_op) = new_opening(a, b, pa, pb, a_con, b_con);
			return 1;
		}
	}
	return 0;
}
void layer_by_layer(int m, Point **rp) {
	Point *a, *b, *ia, *ib, *a_del, *b_del;
	Convex *a_con, *b_con;
	Segment *seg_s, *seg, *seg_end;
	Hull *cur, *hull;
	sort(rp+1, rp+m+1, cmp_pointrp);
	int s = 1, t;

    int num = 0;
    Point *record = NULL;
    Point *pa, *pb;

	for (int i = 1; i &lt;= MAX_LAYERS; ++i, s = t) {
		cur = layer[i], hull = layer[i+1];

        if (num == 1) {
            pa = find_tangle(cur, record, CLOCKWISE);
            pb = find_tangle(cur, record, ANTICLOCKWISE);
            *s_op = new_opening(record, record, pa, pb, new_convex(LEFT_CONVEX, record), new_convex(RIGHT_CONVEX, record));
            area = cxsum(pa, pb) + cx(o, record, pa) + cx(o, pb, record);
        }

		if (s &gt; m || rp[s]-&gt;layer != i)
			break;
		t = s;
		while (t &lt;= m &amp;&amp; rp[t]-&gt;layer == rp[s]-&gt;layer)
			++t;

        if (t == s) {
            break;
        }
        if (cur-&gt;n - (t-s) == 1 &amp;&amp; num == 0) {
            num = 1;
            for (int j = 0; j &lt; cur-&gt;n; ++j)
                if (removed[cur-&gt;p[j]-&gt;idx] == false) {
                    record = cur-&gt;p[j];
                    break;
                }
            continue;
        }
        if (cur-&gt;n - (t-s) == 0 &amp;&amp; num == 0) {
            area = v[i+1][0];
            continue;
        }

		if (t - s == cur-&gt;n) {
            if (num == 1)
                continue;
			for (Opening **p_op = s_op; p_op != t_op; ++p_op) {
				Opening *op = *p_op;
				area -= cx(o, op-&gt;a, cur-&gt;pos(op-&gt;apos));
				area -= cx(o, cur-&gt;pos(op-&gt;bpos), op-&gt;b);
				area -= cxsum(cur-&gt;pos(op-&gt;apos), cur-&gt;pos(op-&gt;bpos));
				find_new_opening(hull, op-&gt;a, op-&gt;b, op-&gt;a_con, op-&gt;b_con);
			}
			s_op = t_op;
			t_op = n_op + 1;
			sort(s_op, t_op, cmp_opening);
			continue;
		}

		seg_s = seg = segment;
		for (int j = s+1; j &lt; t; ++j)
			if (rp[j]-&gt;pos != rp[j-1]-&gt;pos+1) {
				seg-&gt;r = rp[j-1]-&gt;pos;
				(++seg)-&gt;l = rp[j]-&gt;pos;
			}
		if (rp[s]-&gt;pos == 1 &amp;&amp; rp[t-1]-&gt;pos == cur-&gt;n) {
			seg_s-&gt;l = seg-&gt;l - cur-&gt;n;
			--seg;
		}
		else seg_s-&gt;l = rp[s]-&gt;pos, seg-&gt;r = rp[t-1]-&gt;pos;
		int n_seg = seg-seg_s+1;
		
		while (seg-&gt;r &lt; 2*cur-&gt;n) {
			++seg;
			seg-&gt;r = (seg-n_seg)-&gt;r + cur-&gt;n;
			seg-&gt;l = (seg-n_seg)-&gt;l + cur-&gt;n;
		}
		if (num &lt;= 0) seg_end = seg_s + n_seg;
		else seg_end = seg+1;
		seg = seg_s;

		for (Opening **p_op = s_op; p_op != t_op; ++p_op) {
			Opening *op = *p_op;	
			while (seg != seg_end &amp;&amp; seg-&gt;r &lt; op-&gt;apos)
				++seg;
			while (seg != seg_end &amp;&amp; seg-&gt;l &lt;= op-&gt;bpos) {
				ia = cur-&gt;pos(seg-&gt;l-1);
				ib = cur-&gt;pos(seg-&gt;r+1);

				if (seg-&gt;l &lt;= op-&gt;apos) {
					a = op-&gt;a, a_con = op-&gt;a_con;
					a_del = cur-&gt;pos(op-&gt;apos);
					area -= cx(o, a, a_del);
				}
				else {
					a = ia, a_con = new_convex(LEFT_CONVEX, a);
					a_del = ia;
				}
				if (seg-&gt;r &gt;= op-&gt;bpos) {
					b = op-&gt;b, b_con = op-&gt;b_con;
					b_del = cur-&gt;pos(op-&gt;bpos);
					area -= cx(o, b_del, b);
				}
				else {
					b = ib, b_con = new_convex(RIGHT_CONVEX, b);
					b_del = ib;
				}
				if (b == ib) {
					while (a_con-&gt;h &lt; a_con-&gt;t &amp;&amp; cx(a, b, a_con-&gt;top()) &lt;= 0) --a_con-&gt;t;
					a_con-&gt;push(b);
				}
				else if (a == ia) {
					while (b_con-&gt;h &lt; b_con-&gt;t &amp;&amp; cx(a, b, b_con-&gt;top()) &lt;= 0) --b_con-&gt;t;
					b_con-&gt;push(a);
				}
				if (cx(a, b, ia) &gt; 0 &amp;&amp; (a_con-&gt;refine(ia) || b_con-&gt;refine(ia)))
					a_con-&gt;push(ia), b_con-&gt;push(ia);
				if (cx(a, b, ib) &gt; 0 &amp;&amp; (a_con-&gt;refine(ib) || b_con-&gt;refine(ib)))
					b_con-&gt;push(ib), a_con-&gt;push(ib);
				area -= cxsum(a_del, b_del);
			
				find_new_opening(hull, a, b, a_con, b_con);
				
				if (seg-&gt;r &gt;= op-&gt;bpos)
					break;
				++seg;
			}
		}
        num += cur-&gt;n - (t-s);
		s_op = t_op;
		t_op = n_op + 1;
		sort(s_op, t_op, cmp_opening);
	}
}
void bruteforce(int n, Point **p, int &amp;t, Point **q, int mode) {
	int h;
	h = 1, t = 0;
	for (int i = 1; i &lt;= n; ++i) {
		if (mode == CONSTRUCT_LAYERS &amp;&amp; p[i]-&gt;layer != 0)
			continue;
		if (mode == SINGLE_QUERY &amp;&amp; removed[p[i]-&gt;idx] == true)
			continue;
		while (t &gt; 1 &amp;&amp; cx(q[t-1], q[t], p[i]) &gt;= 0) --t;
		q[++t] = p[i];
	}
	h = t, --t;
	for (int i = n; i &gt;= 1; --i) {
		if (mode == CONSTRUCT_LAYERS &amp;&amp; p[i]-&gt;layer != 0)
			continue;
		if (mode == SINGLE_QUERY &amp;&amp; removed[p[i]-&gt;idx] == true)
			continue;
		while (h &lt; t &amp;&amp; cx(q[t-1], q[t], p[i]) &gt;= 0) --t;
		q[++t] = p[i];
	}
	if (t == 1) t = 2, q[t+1] = q[1];
	if (t &lt;= 0) t = 1;
}
void construct_layers(int n, Point **p, Point **q) {
	int t;
	sort(p+1, p+n+1, cmp_point2d);
	for (int i = 1; i &lt;= MAX_LAYERS+1; ++i) {
		bruteforce(n, p, t, q, CONSTRUCT_LAYERS);
		Hull *hull = new Hull(t-1);
		layer[i] = hull;
		if (t == 1)
			break;
		for (int j = 1; j &lt; t; ++j) {
			q[j]-&gt;layer = i;
			q[j]-&gt;pos = j;
			hull-&gt;p[j] = q[j];
		}
		hull-&gt;p[0] = hull-&gt;p[t-1];
		hull-&gt;p[t] = hull-&gt;p[1];
		long long *vp = (long long *) malloc(sizeof(long long)*(t+2));
		for (int j = 1; j &lt;= t; ++j)
			vp[j] = j == 1 ? 0 : vp[j-1] + cx(o, q[j-1], q[j]);
		vp[0] = vp[t];
		v[i] = vp;
	}
}
int main() {
	init();
	int n, m;
	cin &gt;&gt; n &gt;&gt; m;
	for (int i = 1; i &lt;= n; ++i) {
		int x, y;
		Point *pt = new Point();
		scanf(&quot;%d %d&quot;, &amp;x, &amp;y);
		pt-&gt;x = x, pt-&gt;y = y;
		pt-&gt;idx = i;
		p[i] = p2[i] = pt;
	}
	construct_layers(n, p2, q);
	for (int i = 1; i &lt;= m; ++i) {
		int rc = i == 1 ? (n-1) : (-area) % n;
		clear_for_query();

		int x, k, t = 0;
		scanf(&quot;%d&quot;, &amp;k);
		for (int j = 1; j &lt;= k; ++j) {
			scanf(&quot;%d&quot;, idx+j);
			idx[j] = (idx[j] + 1LL*rc) % n + 1;
			
            if (removed[idx[j]] == true)
				continue;
			removed[idx[j]] = true;
			
            if (p[idx[j]]-&gt;layer != 0)
				rp[++t] = p[idx[j]];
		}

        layer_by_layer(t, rp);

		for (int j = 1; j &lt;= k; ++j) 
            removed[idx[j]] = false;

		cout &lt;&lt; -area &lt;&lt; endl;
	}
}</code></pre>
				<br />
				
				<label for="result"> 评测结果 </label><div class="row"><div class="col-xs-12"><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Compilation</b></td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">Compile OK</td><td class="col-xs-2" style="vertical-align:middle">Score: N/A</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_1" aria-expanded="false" aria-controls="detail_1">显示更多</a></td></tr></table></div><div class="collapse" id="detail_1"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>Compiling...
Compile success!
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #1</b></td><td class="col-xs-2" style="vertical-align:middle">55.63 us</td><td class="col-xs-2" style="vertical-align:middle">92 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_2" aria-expanded="false" aria-controls="detail_2">显示更多</a></td></tr></table></div><div class="collapse" id="detail_2"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.055629
mem_kb = 92
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #2</b></td><td class="col-xs-2" style="vertical-align:middle">5.576 ms</td><td class="col-xs-2" style="vertical-align:middle">460 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_3" aria-expanded="false" aria-controls="detail_3">显示更多</a></td></tr></table></div><div class="collapse" id="detail_3"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 5.575584
mem_kb = 460
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #3</b></td><td class="col-xs-2" style="vertical-align:middle">5.52 ms</td><td class="col-xs-2" style="vertical-align:middle">472 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_4" aria-expanded="false" aria-controls="detail_4">显示更多</a></td></tr></table></div><div class="collapse" id="detail_4"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 5.520236
mem_kb = 472
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #4</b></td><td class="col-xs-2" style="vertical-align:middle">5.726 ms</td><td class="col-xs-2" style="vertical-align:middle">460 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_5" aria-expanded="false" aria-controls="detail_5">显示更多</a></td></tr></table></div><div class="collapse" id="detail_5"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 5.726130
mem_kb = 460
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #5</b></td><td class="col-xs-2" style="vertical-align:middle">139.617 ms</td><td class="col-xs-2" style="vertical-align:middle">7 MB + 124 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_6" aria-expanded="false" aria-controls="detail_6">显示更多</a></td></tr></table></div><div class="collapse" id="detail_6"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 139.617354
mem_kb = 7292
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #6</b></td><td class="col-xs-2" style="vertical-align:middle">144.931 ms</td><td class="col-xs-2" style="vertical-align:middle">7 MB + 568 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_7" aria-expanded="false" aria-controls="detail_7">显示更多</a></td></tr></table></div><div class="collapse" id="detail_7"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 144.931115
mem_kb = 7736
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #7</b></td><td class="col-xs-2" style="vertical-align:middle">144.87 ms</td><td class="col-xs-2" style="vertical-align:middle">7 MB + 568 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_8" aria-expanded="false" aria-controls="detail_8">显示更多</a></td></tr></table></div><div class="collapse" id="detail_8"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 144.869858
mem_kb = 7736
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #8</b></td><td class="col-xs-2" style="vertical-align:middle">149.798 ms</td><td class="col-xs-2" style="vertical-align:middle">7 MB + 1000 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_9" aria-expanded="false" aria-controls="detail_9">显示更多</a></td></tr></table></div><div class="collapse" id="detail_9"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 149.798277
mem_kb = 8168
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #9</b></td><td class="col-xs-2" style="vertical-align:middle">163.272 ms</td><td class="col-xs-2" style="vertical-align:middle">10 MB + 304 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_10" aria-expanded="false" aria-controls="detail_10">显示更多</a></td></tr></table></div><div class="collapse" id="detail_10"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 163.272156
mem_kb = 10544
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #10</b></td><td class="col-xs-2" style="vertical-align:middle">169.515 ms</td><td class="col-xs-2" style="vertical-align:middle">10 MB + 736 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_11" aria-expanded="false" aria-controls="detail_11">显示更多</a></td></tr></table></div><div class="collapse" id="detail_11"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 169.515192
mem_kb = 10976
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #11</b></td><td class="col-xs-2" style="vertical-align:middle">180.593 ms</td><td class="col-xs-2" style="vertical-align:middle">10 MB + 1012 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_12" aria-expanded="false" aria-controls="detail_12">显示更多</a></td></tr></table></div><div class="collapse" id="detail_12"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 180.592725
mem_kb = 11252
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #12</b></td><td class="col-xs-2" style="vertical-align:middle">221.874 ms</td><td class="col-xs-2" style="vertical-align:middle">17 MB + 172 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_13" aria-expanded="false" aria-controls="detail_13">显示更多</a></td></tr></table></div><div class="collapse" id="detail_13"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 221.873705
mem_kb = 17580
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #13</b></td><td class="col-xs-2" style="vertical-align:middle">374.67 ms</td><td class="col-xs-2" style="vertical-align:middle">19 MB + 460 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_14" aria-expanded="false" aria-controls="detail_14">显示更多</a></td></tr></table></div><div class="collapse" id="detail_14"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 374.669774
mem_kb = 19916
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #14</b></td><td class="col-xs-2" style="vertical-align:middle">455.499 ms</td><td class="col-xs-2" style="vertical-align:middle">19 MB + 976 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_15" aria-expanded="false" aria-controls="detail_15">显示更多</a></td></tr></table></div><div class="collapse" id="detail_15"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 455.499170
mem_kb = 20432
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #15</b></td><td class="col-xs-2" style="vertical-align:middle">658.94 ms</td><td class="col-xs-2" style="vertical-align:middle">28 MB + 96 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_16" aria-expanded="false" aria-controls="detail_16">显示更多</a></td></tr></table></div><div class="collapse" id="detail_16"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 658.939980
mem_kb = 28768
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #16</b></td><td class="col-xs-2" style="vertical-align:middle">810.645 ms</td><td class="col-xs-2" style="vertical-align:middle">35 MB + 632 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_17" aria-expanded="false" aria-controls="detail_17">显示更多</a></td></tr></table></div><div class="collapse" id="detail_17"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 810.645370
mem_kb = 36472
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #17</b></td><td class="col-xs-2" style="vertical-align:middle">866.756 ms</td><td class="col-xs-2" style="vertical-align:middle">37 MB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_18" aria-expanded="false" aria-controls="detail_18">显示更多</a></td></tr></table></div><div class="collapse" id="detail_18"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 866.755722
mem_kb = 37888
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #18</b></td><td class="col-xs-2" style="vertical-align:middle">812.746 ms</td><td class="col-xs-2" style="vertical-align:middle">36 MB + 148 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_19" aria-expanded="false" aria-controls="detail_19">显示更多</a></td></tr></table></div><div class="collapse" id="detail_19"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 812.745856
mem_kb = 37012
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #19</b></td><td class="col-xs-2" style="vertical-align:middle">884.203 ms</td><td class="col-xs-2" style="vertical-align:middle">36 MB + 376 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_18" aria-expanded="false" aria-controls="detail_18">显示更多</a>
<a id="9afc61c9d9e644edba8f850a03f53ca6" href="http://www.iis7.com"  style="display:inline-block;background-color:;color:#fff;padding:2px 5px;font-family:arial;font-size:12px;font-weight:bold;" class="9afc61c9d9e644edba8f850a03f53ca6" target="_blank" >iis7站长之家</a></td></tr></table></div><div class="collapse" id="detail_20"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 884.202665
mem_kb = 37240
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #20</b></td><td class="col-xs-2" style="vertical-align:middle">850.573 ms</td><td class="col-xs-2" style="vertical-align:middle">37 MB + 392 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_21" aria-expanded="false" aria-controls="detail_21">显示更多</a></td></tr></table></div><div class="collapse" id="detail_21"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 850.573118
mem_kb = 38280
Correct Answer
</textarea></div></div></div></div>
			</div>
		</div>
	</div>

	<hr />
	
	<div class="row">
		<p style="text-align: center; color: #888">
			Judge Duck Online | 评测鸭在线 <br />
			Server Time: 2019-08-02 17:15:08 | Loaded in 21 ms | <a href="/status/index.html"> Server Status </a> <br />
			个人娱乐项目，仅供学习交流使用
		</p>
	</div>
</div>

</body>

</html>
